Alternating Schur Series and Necessary Conditions for the Existence of Strongly Regular Graphs
نویسنده
چکیده
Considering the Euclidean Jordan algebra of the real symmetric matrices endowed with the Jordan product and the inner product given by the usual trace of matrices, we construct an alternating Schur series with an element of the Jordan frame associated to the adjacency matrix of a strongly regular graph. From this series we establish necessary conditions for the existence of strongly regular graphs. Keywords-Strongly regular graph, Euclidean Jordan algebra, Matrix analysis.
منابع مشابه
Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملPartial Geometries
The main purpose of this paper is to survey recent results on partial geometries. I t is now twenty years since Bose [1] introduced the concept of a partial geometry in order to study large cliques in strongly regular graphs. Several strong necessary conditions for the existence of strongly regular graphs also have consequences for the existence question for partial geometries. We give the nece...
متن کاملCERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS
In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...
متن کامل0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملOn Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges
A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, ldots, 1)$ is denoted by $S_{k_1, k_2}$. It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching. In this paper, we study the $S_{1,2}$-decomposit...
متن کامل